
//
//static void print_nodes(const struct buddy2 * self)
//{
//    int i;
//    int level, prev_level = -1;
//    double temp = 0.0;
//    for (i = 0; i < 2 * self->size - 1; i++) {
//        level = (int) (log(i + 1) / log(2));
//        if (level != prev_level && i != 0)
//            printf("\n");
//        printf("[%.2d] = %u ", i, self->longest[i]);
//        prev_level = level;
//    }
//}

int main()
{
    return 0;
}

